Manuel Baclet and Claire Pagetti Around Hopcroft ’ s Algorithm Research Report LSV - 06 - 12 May 2006

Around Hopcroft's Algorithm

In this paper, a reflection is made on an indeterminism inherent to Hopcroft’s minimization algorithm: the splitter choice. We have implemented two natural policies (FIFO and FILO) for managing the set of splitters for which we obtain the following practical results: the FILO strategy performs better than the FIFO strategy, in the case of a one letter alphabet, the practical complexity in the F...

Benedikt Bollig and Dietrich Kuske Distributed Muller Automata and Logics Research Report LSV - 06 - 11 May 2006

We consider Muller asynchronous cellular automata running on infinite dags over distributed alphabets. We show that they have the same expressive power as the existential fragment of a monadic secondorder logic featuring a first-order quantifier to express that there are infinitely many elements satisfying some property. Our result is based on an extension of the classical Ehrenfeucht-Fräıssé g...

On the Urgency Expressiveness

Traces of randomized distributed algorithms as Gibbs fields Research Report LSV − 02 −

On the Behavioral Equivalence Between k-data Structures

or specifications. Sci. Comput. Program., 25, 149–186. [7] Goguen, J. and Malcolm, G. (2000) A hidden agenda. Theor. Comput. Sci., 245, 55–101. [8] Blok, W. and Pigozzi, D. (1992) Algebraic semantics for universal Horn logic without equality. In Romanowska, A. and Smith, J.D.H. (eds.) Universal algebra and quasigroup theory, Lect. Conf., 1989. Res. Expo. Math. Vol. 19. pp. 1–56, Heldermann Verl...